package astudy.tree;

public interface Tree<T extends Comparable> {

	public TreeNode<T> find(TreeNode<T> root, T data);
	public TreeNode<T> min(TreeNode<T> root);
	public TreeNode<T> max(TreeNode<T> root);
	public TreeNode<T> prev(TreeNode<T> node);
	public TreeNode<T> next(TreeNode<T> node);
	public void insert(TreeNode<T> node);
	public void delete(TreeNode<T> node);
}
